On 2k-Twisted Graphs
نویسندگان
چکیده
منابع مشابه
On 2k-Twisted Graphs
We define the concept of a k-twisted chain in a (directed) graph and the concept of a 2k-twisted graph. We show that for a 2k-twisted graph the set of algebraic 2k-twisted cycles is an integral spanning set for the integral flow module of G. Since a graph is O-twisted if and only if it is strongly connected, our result generalizes the well-known theorem that there is a basis for the flow space ...
متن کاملOn path decompositions of 2k-regular graphs
Tibor Gallai conjectured that the edge set of every connected graph G on n vertices can be partitioned into ⌈n/2⌉ paths. Let Gk be the class of all 2k-regular graphs of girth at least 2k − 2 that admit a pair of disjoint perfect matchings. In this work, we show that Gallai’s conjecture holds in Gk, for every k ≥ 3. Further, we prove that for every graph G in Gk on n vertices, there exists a par...
متن کاملEfficient Construction of 2K+ Graphs
I. INTRODUCTION Researchers often need to generate synthetic graphs with key properties resembling those of networks of interest. This is for example the case when the full topology is unavailable or impractical to measure or use. In our work, we are interested in generating graphs that resemble online social networks in terms of their joint degree distribution (JDM) and their degree-dependent ...
متن کاملA result on 2k-cycle-free bipartite graphs
Let G be a bipartite graph with vertex parts of orders N and M , and X edges. I prove that if G has no cycles of length 2l, for all l ∈ [2, 2k], and N ≥ M , then X < M 1 2 N k+1 2k + O(N).
متن کاملA Note on Bipartite Graphs without 2k-Cycles
We address the question of the maximum number ex(m,n, C2k) of edges in an m by n bipartite graph without a cycle of length 2k. We prove that for each k ≥ 2, ex(m,n, C2k) ≤ (2k − 3) [ (mn) k+1 k + m + n ] if k is odd. (2k − 3) [ m k+2 k n 1 2 + m + n ] if k is even.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1987
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(87)80035-5